Brèves communications. 0-1 optimization and non-linear programming

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the optimization of Dombi non-linear programming

Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...

متن کامل

0/1-Integer Programming: Optimization and Augmentation are Equivalent

For every fixed set F ⊆ {0, 1}n the following problems are strongly polynomial time equivalent: given a feasible point x ∈ F and a linear objective function c ∈ ZZn, • find a feasible point x∗ ∈ F that maximizes cx (Optimization), • find a feasible point x ∈ F with cx > cx (Augmentation), and • find a feasible point x ∈ F with cx > cx such that x − x is “irreducible” (Irreducible Augmentation)....

متن کامل

Linear Programming and Network Optimization

Here, C denotes a column vector of cost coefficients, X a column vector of variables, A = [ai,j ] is a coefficient matrix, B is a column vector representing the bounds in the inequalities and the multiplication operation is matrix multiplication. Linear programs arise in a wide range of applications and can be solved efficiently. The classical simplex algorithm has been very successful in pract...

متن کامل

Cs 598csc: Combinatorial Optimization 1 Polyhedra and Linear Programming

In this lecture, we will cover some basic material on the structure of polyhedra and linear programming. There is too abundant material on this topic to be covered in a few classes, so pointers will be given for further reading. For algorithmic and computational purposes one needs to work with rational polyhedra. Many basic results, however, are valid for both real and rational polyhedra. There...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle

سال: 1972

ISSN: 0397-9350

DOI: 10.1051/ro/197206v200951